Characteristic Polynomials

نویسنده

  • HANS SCHNEIDER
چکیده

Introduction. Let F be a field and let V be a finite dimensional vector space over F which is also a module over the ring F[a]. Here a may lie in any extension ring of F. We do not assume, as yet, that V is a faithful module, so that a need not be a linear transformation on V. It is known that by means of a decomposition of V into cyclic F[a]-modules we may obtain a definition of the characteristic polynomial of a on V which does not involve determinants. In this note we shall give another non-determinantal definition of the characteristic polynomial. Instead of considering a single module V, we shall accordingly study the set of all finite dimensional F[a]-modules and mappings of this set into monic polynomials with coefficients in F. Admittedly our procedure does not yield the theory of the elementary divisors of a, but it has certain advantages. First , all questions of uniqueness are settled immediately by the Jordan-Holder theorem. Secondly, it is possible to derive some classical results, usually proved using determinants, without excessive labour. To illustrate the use of our method we shall complete and generalise some results due to Goldhaber (2) and Osborne (5).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Buckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries

The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...

متن کامل

On generalized Lucas sequences

We introduce the notions of unsigned and signed generalized Lucas sequences and prove certain polynomial recurrence relations on their characteristic polynomials. We also characterize when these characteristic polynomials are irreducible polynomials over a finite field. Moreover, we obtain the explicit expressions of the remainders of Dickson polynomials of the first kind divided by the charact...

متن کامل

Characteristic polynomials of ramified uniform covering digraphs

We give a decomposition formula for the characteristic polynomials of ramified uniform covers of digraphs. Similarly, we obtain a decomposition formula for the characteristic polynomials of ramified regular covers of digraphs. As applications, we establish decomposition formulas for the characteristic polynomials of branched covers of digraphs and the zeta functions of ramified covers of digraphs.

متن کامل

On the Characteristic and Permanent Polynomials of a Matrix

There is a digraph corresponding to every square matrix over C. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence relation, we found that the characteristic, and permanent polynomials can be calculated in terms of characteristic, and permanent polynomials of some specific induced s...

متن کامل

The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs and Their Complements

The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many unresolved problems in graph reconstruction. In this paper we prove that the characteristic polynomial of a graph is reconstructible from the characteristic polynomials of the vertex-deleted subgraphs of the graph and...

متن کامل

Universal Results for Correlations of Characteristic Polynomials: Riemann-Hilbert Approach

Abstract We prove that general correlation functions of both ratios and products of characteristic polynomials of Hermitian random matrices are governed by integrable kernels of three different types: a) those constructed from orthogonal polynomials; b) constructed from Cauchy transforms of the same orthogonal polynomials and finally c) those constructed from both orthogonal polynomials and the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009